GRAPE: Genetic Routing And Placement Engine
نویسنده
چکیده
Traditional VLSI systems automatically place and route circuits using two independent steps; first an optimal placement is determined by using wire length estimates, then an optimal routing is attempted for the given placement. In actuality, placement and routing can have complicated interactions, and separating them can lead to conservative and un-optimal solutions. GRAPE, a Genetic Routing And Placement Engine, leverages the power of genetic algorithms to simultaneously optimize the placement and routing of a circuit. Using GRAPE, a population of individual placement and routing solutions evolve to maximize connectedness and minimize area.
منابع مشابه
A Routing-Aware Simulated Annealing-based Placement Method in Wireless Network on Chips
Wireless network on chip (WiNoC) is one of the promising on-chip interconnection networks for on-chip system architectures. In addition to wired links, these architectures also use wireless links. Using these wireless links makes packets reach destination nodes faster and with less power consumption. These wireless links are provided by wireless interfaces in wireless routers. The WiNoC archite...
متن کاملConvex Optimization and Utility Theory: New Trends in VLSI Circuit Layout by
The design of modern integrated circuits is overwhelmingly complicated due to the enormous number of cells in a typical modern circuit. To deal with this di culty, the design procedure is broken down into a set of disjoint tasks. Circuit layout is the task that refers to the physical realization of a circuit from its functional description. In circuit layout, a connection-list called netlist of...
متن کاملUTPlaceF 2.0: A High-Performance Clock-Aware FPGA Placement Engine
Modern field-programmable gate array (FPGA) devices contain complex clock architectures on top of configurable logics. Unlike application specific integrated circuits (ASICs), the physical structure of clock networks in an FPGA is pre-manufactured and cannot be adjusted to different applications. Furthermore, clock routing resources are typically limited for high-utilization designs. Consequent...
متن کاملGenetic Design of Vlsi Layouts
A genetic algorithm for the physical design of VLSI chips is presented The algorithm simultane ously optimizes the placement of the cells with the total routing During the placement the detailed routing is done while the global routes are opti mized by the genetic algorithm This is just opposed to the usual serial ap proach where the computation of the detailed routing is the last step in the l...
متن کاملGenetic Algorithm for FPGA Placement
Field-Programmable Gate Arrays (FPGAs) are flexible circuits that can be (re)configured by the designer. The efficient use of these circuits requires complex CAD tools. One of the steps of the design process for FPGAs is represented by placement. In this paper we present a genetic algorithm for the FPGA placement problem, in particular for the Atmel FPGA circuits. Because of the limited routing...
متن کامل